منابع مشابه
Dynamic Scheduling on Parallel Machines
We study the problem of online job-scheduling on parallel machines with di erent network topologies. An online scheduling algorithm schedules a collection of parallel jobs with known resource requirements but unknown running times on a parallel machine. We give an O(plog logN)-competitive algorithm for online scheduling on a two-dimensional mesh of N processors and we prove a matching lower bou...
متن کاملFlexible flowshop scheduling with equal number of unrelated parallel machines
This article addresses a multi-stage flowshop scheduling problem with equal number of unrelated parallel machines. The objective is to minimize the makespan for a given set of jobs in the system. This problem class is NP-hard in the strong sense, so a hybrid heuristic method for sequencing and then allocating operations of jobs to machines is developed. A number of test problems are randomly ge...
متن کاملDynamic scheduling on parallel
Feldmann, A., J. Sgall and S.-H. Teng, Dynamic scheduling on parallel machines, Theoretical Computer Science 130 (1994) 49-72. We study the problem of on-line job-scheduling on parallel machines with different network topologies. An on-line scheduling algorithm schedules a collection of parallel jobs with known resource requirements but unknown running times on a parallel machine. We give an O(...
متن کاملScheduling parallel machines by the dynamic newsboy problem
The newsboy problem is a well-known operations research model. Its various extensions have been applied to scheduling and evaluating advanced orders in manufacturing, retail and service industries. This paper focuses on a dynamic, continuous-time generalization of the single period newsboy problem. Similar to the classical newsboy problem, the model may represent the inventory of an item that b...
متن کاملApproximation Schemes for Scheduling on Parallel Machines
We discuss scheduling problems with m identical machines and n jobs where each job has to be assigned to some machine. The goal is to optimize objective functions that solely depend on the machine completion times. As a main result, we identify some conditions on the objective function, under which the resulting scheduling problems possess a polynomial time approximation scheme. Our result cont...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 1994
ISSN: 0304-3975
DOI: 10.1016/0304-3975(94)90152-x